#include <iostream>
#include <vector>
#include <string>
#include <map>
#include <queue>
#include <limits.h>

using namespace std;

#include "UnionFindSet.h"
#include "Graph.h"

void test1();

int main()
{
	//Matrix::TestGraph();
	/*TestUnionFindSet();
	Adjacency_tables::TestGraph1();*/

	//Matrix::test1();

	//Adjacency_tables::test1();
	//cout << endl;
	//Matrix::test1();

    test1();

	return 0;
}

void test1()
{
    string s1;
    s1.push_back('a');
    s1.push_back('a');
    s1.push_back('a');
    s1.push_back('a');
    s1.push_back('a');
    s1.push_back('a');
    s1.push_back('a');
    s1.push_back('a');
    s1.push_back('a');
    s1.push_back('a');
    s1.push_back('a');
}
